منابع مشابه
Decoding of Matrix-Product Codes
We propose a decoding algorithm for the (u | u+ v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code.
متن کاملList decoding of matrix-product codes from nested codes: An application to quasi-cyclic codes
A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear codes and A is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Further...
متن کاملIterative Soft Permutation Decoding of Product Codes
In this paper the performance of product codes based on quadratic residue codes is investigated. Our Proposed Iterative decoding SISO based on a soft permutation decoding algorithm (SPDA) as a component decoder. Numerical result for the proposed algorithm over Additive White Gaussian Noise (AWGN) channel is provided. Results show that the turbo effect of the proposed decoder algorithm is establ...
متن کاملNear-optimum decoding of product codes: block turbo codes
This paper describes an iterative decoding algorithm for any product code built using linear block codes. It is based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration. This soft-input/soft-output decoder is a Chase decoder which delivers soft outputs instead of binary decisions. The soft output of the decoder is a...
متن کاملDecoding Reed-Muller Codes Over Product Sets
We give a polynomial time algorithm to decode multivariate polynomial codes of degree d up to half their minimum distance, when the evaluation points are an arbitrary product set S, for every d < |S|. Previously known algorithms could achieve this only if the set S had some very special algebraic structure, or if the degree d was significantly smaller than |S|. We also give a near-linear time r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2013
ISSN: 0219-4988,1793-6829
DOI: 10.1142/s021949881250185x